Game semantics for non-monotonic intensional logic programming
نویسندگان
چکیده
منابع مشابه
Prolegomena to Logic Programming for Non-monotonic Reasoning Prolegomena to Logic Programming for Non{monotonic Reasoning
The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the p...
متن کاملLogic Programming for Non-Monotonic Reasoning
Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypot...
متن کاملA Game Semantics Foundation for Logic Programming
We introduce a semantics of Logic Programming based on classical Game Theory, which is proven to be sound and complete w.r.t. traditional semantics like the minimum Herbrand model and the s-semantics. This AND compositional game semantics allows a very simple characterization of the solution set of a logic program in term of approximations of the value of the game associated to it, which can al...
متن کاملA game semantics for disjunctive logic programming
Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, a game semantics was given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later it was extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent to the traditional se...
متن کاملInfinite-game Semantics for Logic Programming Languages
This thesis focuses on the study of the semantics of logic programs and the development of infinite games of perfect information between two players, that capture this semantics. We define a game that, given a propositional logic program with negation and a ground atom that belongs to it, may have three possible results (win for any of the players or tie). The game is determined. Based on this,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2017
ISSN: 0168-0072
DOI: 10.1016/j.apal.2016.10.005